Nuprl Lemma : strict-fun-connected_irreflexivity
11,40
postcript
pdf
T
:Type,
f
:(
T
T
),
x
:
T
.
x
=
f
+(
x
)
False
latex
Definitions
Type
,
t
T
,
s
=
t
,
x
:
A
B
(
x
)
,
x
:
A
.
B
(
x
)
,
y
is
f
*(
x
)
,
,
A
,
x
:
A
B
(
x
)
,
P
&
Q
,
False
,
Void
,
P
Q
,
y
=
f
+(
x
)
Lemmas
not
wf
,
fun-connected
wf
origin
T:Type, f:(T
T), x:T. x = f+(x) 
False T:Type, f:(TT), x:T. x = f+(x) False 
TB(x)x:A. B(x)
A
B(x) Q